Ultrafast Randomized Parallel Construction and Approximation Algorithms for Spanning Forests in Dense Graphs
نویسندگان
چکیده
We present a rst randomized O(log n) time and O(n+m) work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a randomized O(log log n) time and O(n log n) work CREW-PRAM algorithm for nding spanning trees in random graphs.
منابع مشابه
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
We present the rst randomized O(log n) time and O(m+n) work EREW PRAM algorithm for nding a spanning forest of an undirected graph G = (V; E) with n vertices and m edges. Our algorithm is optimal with respect to time, work and space. As a consequence we get optimal randomized EREW PRAM algorithms for other basic connectivity problems such as nding a bipartite partition, nding bridges and biconn...
متن کاملA Parallel GRASP for the Steiner Problem in Graphs
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of (terminal) nodes of the original graph. In this paper, we describe a parallel GRASP for the Steiner problem in graphs. We review b...
متن کاملConcentration inequalities for nonlinear matroid intersection
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that has numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree, Unrelated Parallel Machines Scheduling and Scheduling with Time Windows and Nonlinear ...
متن کاملOptimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs (Preliminary Version)
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal matching can all be constructed in (log n) expected time using n= log n processors on the CRCW PRAM. This is a substantial improvement over the best previous algorithms, which required ((log log n)) time and n log n p...
متن کاملRandomized Algorithms for Graph Problems
Randomization is a powerful tool in the design of algorithms. In this proposal we use randomness to make progress on several old and fundamental problems. We close the approximability of feedback arc set on tournament graphs, first studied around 1961 [16], by designing a PTAS. We give a practical algorithm with improved performance for finding strongly connected components in parallel (first s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998